0.02/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.11	% Command    : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM
0.12/0.31	% Computer : n018.cluster.edu
0.12/0.31	% Model    : x86_64 x86_64
0.12/0.31	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.31	% Memory   : 8042.1875MB
0.12/0.31	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.31	% CPULimit   : 1920
0.12/0.31	% WCLimit    : 240
0.12/0.31	% DateTime   : Wed Jul 30 08:36:19 EDT 2025
0.12/0.32	% CPUTime    : 
0.18/0.44	Running higher-order theorem proving
0.18/0.50	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.xd2Y0qcij7/E---3.1_2273.p
0.48/0.60	# Version: 3.0.0-ho
0.48/0.60	# Preprocessing class: HSLMSMSMLLLCHSA.
0.48/0.60	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
0.48/0.60	# Starting pre_casc_4 with 960s (4) cores
0.48/0.60	# Starting full_lambda_6 with 240s (1) cores
0.48/0.60	# Starting sh10 with 240s (1) cores
0.48/0.60	# Starting post_as_ho9 with 240s (1) cores
0.48/0.60	# Starting post_as_ho8 with 240s (1) cores
0.48/0.60	# pre_casc_4 with pid 2352 completed with status 0
0.48/0.60	# Result found by pre_casc_4
0.48/0.60	# Preprocessing class: HSLMSMSMLLLCHSA.
0.48/0.60	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
0.48/0.60	# Starting pre_casc_4 with 960s (4) cores
0.48/0.60	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.48/0.60	# Search class: HGUSM-FSLM31-DHSMMFBN
0.48/0.60	# partial match(2): HGUSM-FSLM31-DHSFFFBN
0.48/0.60	# Scheduled 6 strats onto 4 cores with 960 seconds (960 total)
0.48/0.60	# Starting new_bool_5 with 432s (1) cores
0.48/0.60	# Starting pre_casc_4 with 97s (1) cores
0.48/0.60	# Starting ehoh_best8_lambda with 108s (1) cores
0.48/0.60	# Starting new_bool_1 with 108s (1) cores
0.48/0.60	# new_bool_5 with pid 2358 completed with status 0
0.48/0.60	# Result found by new_bool_5
0.48/0.60	# Preprocessing class: HSLMSMSMLLLCHSA.
0.48/0.60	# Scheduled 5 strats onto 8 cores with 240 seconds (1920 total)
0.48/0.60	# Starting pre_casc_4 with 960s (4) cores
0.48/0.60	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.48/0.60	# Search class: HGUSM-FSLM31-DHSMMFBN
0.48/0.60	# partial match(2): HGUSM-FSLM31-DHSFFFBN
0.48/0.60	# Scheduled 6 strats onto 4 cores with 960 seconds (960 total)
0.48/0.60	# Starting new_bool_5 with 432s (1) cores
0.48/0.60	# Preprocessing time       : 0.005 s
0.48/0.60	# Presaturation interreduction done
0.48/0.60	
0.48/0.60	# Proof found!
0.48/0.60	# SZS status Theorem
0.48/0.60	# SZS output start CNFRefutation
0.48/0.60	thf(decl_23, type, is_of: $i > ($i > $o) > $o).
0.48/0.60	thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o).
0.48/0.60	thf(decl_26, type, in: $i > $i > $o).
0.48/0.60	thf(decl_78, type, e_is: $i > $i > $i > $o).
0.48/0.60	thf(decl_125, type, n_is: $i > $i > $o).
0.48/0.60	thf(decl_163, type, n_ts: $i > $i > $i).
0.48/0.60	thf(decl_190, type, frac: $i).
0.48/0.60	thf(decl_192, type, num: $i > $i).
0.48/0.60	thf(decl_193, type, den: $i > $i).
0.48/0.60	thf(decl_194, type, n_eq: $i > $i > $o).
0.48/0.60	thf(decl_199, type, n_pf: $i > $i > $i).
0.48/0.60	thf(decl_200, type, esk1_0: $i).
0.48/0.60	thf(decl_201, type, esk2_0: $i).
0.48/0.60	thf(decl_202, type, esk3_0: $i).
0.48/0.60	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.xd2Y0qcij7/E---3.1_2273.p', def_e_is)).
0.48/0.60	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.xd2Y0qcij7/E---3.1_2273.p', def_all_of)).
0.48/0.60	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.xd2Y0qcij7/E---3.1_2273.p', def_is_of)).
0.48/0.60	thf(def_n_eq, axiom, ((n_eq)=(^[X1:$i, X218:$i]:((n_is @ (n_ts @ (num @ X1) @ (den @ X218)) @ (n_ts @ (num @ X218) @ (den @ X1)))))), file('/export/starexec/sandbox/tmp/tmp.xd2Y0qcij7/E---3.1_2273.p', def_n_eq)).
0.48/0.60	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.xd2Y0qcij7/E---3.1_2273.p', def_n_is)).
0.48/0.60	thf(satz62b, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X475:$i]:((in @ X475 @ frac))) @ (^[X476:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:(((n_eq @ X1 @ X476)=>(n_eq @ (n_pf @ X1 @ X4) @ (n_pf @ X476 @ X4)))))))))))), file('/export/starexec/sandbox/tmp/tmp.xd2Y0qcij7/E---3.1_2273.p', satz62b)).
0.48/0.60	thf(satz56, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X285:$i]:((in @ X285 @ frac))) @ (^[X286:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ frac))) @ (^[X10:$i]:(((n_eq @ X1 @ X286)=>((n_eq @ X4 @ X10)=>(n_eq @ (n_pf @ X1 @ X4) @ (n_pf @ X286 @ X10)))))))))))))))), file('/export/starexec/sandbox/tmp/tmp.xd2Y0qcij7/E---3.1_2273.p', satz56)).
0.48/0.60	thf(c_0_7, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.48/0.60	thf(c_0_8, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.48/0.60	thf(c_0_9, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.48/0.60	thf(c_0_10, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_ts @ (num @ Z1) @ (den @ Z0))))))), inference(fof_simplification,[status(thm)],[def_n_eq])).
0.48/0.60	thf(c_0_11, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_7])).
0.48/0.60	thf(c_0_12, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_8, c_0_9])).
0.48/0.60	thf(c_0_13, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_ts @ (num @ Z1) @ (den @ Z0))))))), inference(apply_def,[status(thm)],[c_0_10, c_0_11])).
0.48/0.60	thf(c_0_14, negated_conjecture, ~(![X568:$i]:(((in @ X568 @ frac)=>![X567:$i]:(((in @ X567 @ frac)=>![X566:$i]:(((in @ X566 @ frac)=>(((n_ts @ (num @ X568) @ (den @ X567))=(n_ts @ (num @ X567) @ (den @ X568)))=>((n_ts @ (num @ (n_pf @ X568 @ X566)) @ (den @ (n_pf @ X567 @ X566)))=(n_ts @ (num @ (n_pf @ X567 @ X566)) @ (den @ (n_pf @ X568 @ X566)))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz62b])]), c_0_12]), c_0_13])).
0.48/0.60	thf(c_0_15, plain, ![X578:$i]:(((in @ X578 @ frac)=>![X577:$i]:(((in @ X577 @ frac)=>![X576:$i]:(((in @ X576 @ frac)=>![X575:$i]:(((in @ X575 @ frac)=>(((n_ts @ (num @ X578) @ (den @ X577))=(n_ts @ (num @ X577) @ (den @ X578)))=>(((n_ts @ (num @ X576) @ (den @ X575))=(n_ts @ (num @ X575) @ (den @ X576)))=>((n_ts @ (num @ (n_pf @ X578 @ X576)) @ (den @ (n_pf @ X577 @ X575)))=(n_ts @ (num @ (n_pf @ X577 @ X575)) @ (den @ (n_pf @ X578 @ X576)))))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz56]), c_0_12]), c_0_13])).
0.48/0.60	thf(c_0_16, negated_conjecture, ((in @ esk1_0 @ frac)&((in @ esk2_0 @ frac)&((in @ esk3_0 @ frac)&(((n_ts @ (num @ esk1_0) @ (den @ esk2_0))=(n_ts @ (num @ esk2_0) @ (den @ esk1_0)))&((n_ts @ (num @ (n_pf @ esk1_0 @ esk3_0)) @ (den @ (n_pf @ esk2_0 @ esk3_0)))!=(n_ts @ (num @ (n_pf @ esk2_0 @ esk3_0)) @ (den @ (n_pf @ esk1_0 @ esk3_0)))))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])).
0.48/0.60	thf(c_0_17, plain, ![X830:$i, X831:$i, X832:$i, X833:$i]:((~(in @ X830 @ frac)|(~(in @ X831 @ frac)|(~(in @ X832 @ frac)|(~(in @ X833 @ frac)|(((n_ts @ (num @ X830) @ (den @ X831))!=(n_ts @ (num @ X831) @ (den @ X830)))|(((n_ts @ (num @ X832) @ (den @ X833))!=(n_ts @ (num @ X833) @ (den @ X832)))|((n_ts @ (num @ (n_pf @ X830 @ X832)) @ (den @ (n_pf @ X831 @ X833)))=(n_ts @ (num @ (n_pf @ X831 @ X833)) @ (den @ (n_pf @ X830 @ X832))))))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])).
0.48/0.60	thf(c_0_18, negated_conjecture, ((n_ts @ (num @ (n_pf @ esk1_0 @ esk3_0)) @ (den @ (n_pf @ esk2_0 @ esk3_0)))!=(n_ts @ (num @ (n_pf @ esk2_0 @ esk3_0)) @ (den @ (n_pf @ esk1_0 @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.48/0.60	thf(c_0_19, plain, ![X1:$i, X4:$i, X6:$i, X5:$i]:((((n_ts @ (num @ (n_pf @ X1 @ X5)) @ (den @ (n_pf @ X4 @ X6)))=(n_ts @ (num @ (n_pf @ X4 @ X6)) @ (den @ (n_pf @ X1 @ X5))))|~((in @ X1 @ frac))|~((in @ X4 @ frac))|~((in @ X5 @ frac))|~((in @ X6 @ frac))|((n_ts @ (num @ X1) @ (den @ X4))!=(n_ts @ (num @ X4) @ (den @ X1)))|((n_ts @ (num @ X5) @ (den @ X6))!=(n_ts @ (num @ X6) @ (den @ X5))))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.48/0.60	thf(c_0_20, negated_conjecture, ((n_ts @ (num @ esk1_0) @ (den @ esk2_0))=(n_ts @ (num @ esk2_0) @ (den @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.48/0.60	thf(c_0_21, negated_conjecture, (in @ esk3_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_16])).
0.48/0.60	thf(c_0_22, negated_conjecture, (in @ esk2_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_16])).
0.48/0.60	thf(c_0_23, negated_conjecture, (in @ esk1_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_16])).
0.48/0.60	thf(c_0_24, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_21]), c_0_22]), c_0_23])]), ['proof']).
0.48/0.60	# SZS output end CNFRefutation
0.48/0.60	# Parsed axioms                        : 583
0.48/0.60	# Removed by relevancy pruning/SinE    : 446
0.48/0.60	# Initial clauses                      : 138
0.48/0.60	# Removed in clause preprocessing      : 12
0.48/0.60	# Initial clauses in saturation        : 126
0.48/0.60	# Processed clauses                    : 279
0.48/0.60	# ...of these trivial                  : 3
0.48/0.60	# ...subsumed                          : 51
0.48/0.60	# ...remaining for further processing  : 225
0.48/0.60	# Other redundant clauses eliminated   : 16
0.48/0.60	# Clauses deleted for lack of memory   : 0
0.48/0.60	# Backward-subsumed                    : 0
0.48/0.60	# Backward-rewritten                   : 6
0.48/0.60	# Generated clauses                    : 699
0.48/0.60	# ...of the previous two non-redundant : 641
0.48/0.60	# ...aggressively subsumed             : 0
0.48/0.60	# Contextual simplify-reflections      : 0
0.48/0.60	# Paramodulations                      : 639
0.48/0.60	# Factorizations                       : 0
0.48/0.60	# NegExts                              : 1
0.48/0.60	# Equation resolutions                 : 22
0.48/0.60	# Disequality decompositions           : 0
0.48/0.60	# Total rewrite steps                  : 304
0.48/0.60	# ...of those cached                   : 262
0.48/0.60	# Propositional unsat checks           : 0
0.48/0.60	#    Propositional check models        : 0
0.48/0.60	#    Propositional check unsatisfiable : 0
0.48/0.60	#    Propositional clauses             : 0
0.48/0.60	#    Propositional clauses after purity: 0
0.48/0.60	#    Propositional unsat core size     : 0
0.48/0.60	#    Propositional preprocessing time  : 0.000
0.48/0.60	#    Propositional encoding time       : 0.000
0.48/0.60	#    Propositional solver time         : 0.000
0.48/0.60	#    Success case prop preproc time    : 0.000
0.48/0.60	#    Success case prop encoding time   : 0.000
0.48/0.60	#    Success case prop solver time     : 0.000
0.48/0.60	# Current number of processed clauses  : 119
0.48/0.60	#    Positive orientable unit clauses  : 49
0.48/0.60	#    Positive unorientable unit clauses: 0
0.48/0.60	#    Negative unit clauses             : 9
0.48/0.60	#    Non-unit-clauses                  : 61
0.48/0.60	# Current number of unprocessed clauses: 556
0.48/0.60	# ...number of literals in the above   : 2522
0.48/0.60	# Current number of archived formulas  : 0
0.48/0.60	# Current number of archived clauses   : 98
0.48/0.60	# Clause-clause subsumption calls (NU) : 6385
0.48/0.60	# Rec. Clause-clause subsumption calls : 1157
0.48/0.60	# Non-unit clause-clause subsumptions  : 40
0.48/0.60	# Unit Clause-clause subsumption calls : 58
0.48/0.60	# Rewrite failures with RHS unbound    : 0
0.48/0.60	# BW rewrite match attempts            : 20
0.48/0.60	# BW rewrite match successes           : 6
0.48/0.60	# Condensation attempts                : 279
0.48/0.60	# Condensation successes               : 0
0.48/0.60	# Termbank termtop insertions          : 64995
0.48/0.60	# Search garbage collected termcells   : 16601
0.48/0.60	
0.48/0.60	# -------------------------------------------------
0.48/0.60	# User time                : 0.064 s
0.48/0.60	# System time              : 0.008 s
0.48/0.60	# Total time               : 0.072 s
0.48/0.60	# Maximum resident set size: 5272 pages
0.48/0.60	
0.48/0.60	# -------------------------------------------------
0.48/0.60	# User time                : 0.194 s
0.48/0.60	# System time              : 0.027 s
0.48/0.60	# Total time               : 0.220 s
0.48/0.60	# Maximum resident set size: 2804 pages
0.48/0.60	% E exiting
0.48/0.60	% E exiting
0.48/0.60	EOF